An interval-based SAT modulo ODE solver for model checking nonlinear hybrid systems

SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems

SAT-Modulo-Theory based Analysis of Probabilistic Hybrid Systems

The framework of hybrid discrete-continuous systems becomes increasingly popular for modeling and verifying large real-world, often safety-critical, embedded systems, e.g. in the car and aviation industry. In contrast to purely discrete models, like Kripke structures, hybrid systems additionally show continuous behavior usually modeled by differential equations. Therefore, the state space of a ...

Bounded model checking of Time Petri Nets using SAT solver

To carry out performance evaluation of an asynchronous system, the system is modeled as Time Petri Net (TPN) and an iteration of Petri net simulations produces its performance index. The TPN model needs to satisfy required properties such as deadlock freeness. We proposed a symbolic representation of TPN for SAT-based bounded model checking. In the proposed encoding scheme, firing of transition...

Sat-based Model Checking for Region Automata

For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this regard, but SAT-based model checking, i.e. bounded model checking (BMC), shows some promise. However, unlike traditional model checking, for which time systems have been thoroughly researched, BMC is less capable of mode...

Hybrid BDD and All-SAT Method for Model Checking

We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SAT procedure. The All-SAT procedure exploits a graph representation of the model to dynamically prune the search space, thus preventing unnecessary search in large sub-spaces, and for identifying independent sub-problem...